Simple concurrent garbage collection almost without synchronization
نویسندگان
چکیده
منابع مشابه
Simple concurrent garbage collection almost without synchronization
We present two simple mark and sweep algorithms, A and B, for concurrent garbage collection by a single collector running concurrently with a number of mutators that concurrently modify shared data. Both algorithms are based on the ideas of Ben-Ari’s classical algorithm for on-the-fly garbage collection with one mutator. The algorithms require the mutators to estimate the set of objects they cu...
متن کاملCyclic Distributed Garbage Collection Without Global Synchronization in CORBA
1 Abstract This paper describes an algorithm for cyclic distributed garbage collection and its implementation. The algorithm is an extension of reference-listing that collects cyclic garbage. It uses back-tracing instead of mark-and-sweep to eliminate the need of global synchronization. First, by using a special heuristic the algorithm chooses an object that is likely to be garbage (suspect). T...
متن کاملConcurrent Garbage Collection in O2
ing is modified in the system while the GC is examining it in order to determine which objects are garbage. We describe a concurrent garbage collector (GC) for object-oriented databases. Our GC uses a new synchronization mechanism (mechanism that allows the GC to operate concurrently with ordinary users of the database), called CC-consistent cuts. A GC-consistent cut is a set of virtual copies ...
متن کاملConcurrent garbage collection for C++
Automatic storage management, or garbage collection, is a feature usually associated with languages oriented toward "symbolic processing," such as Lisp or Prolog; it is seldom associated with "systems" languages, such as C and C++. This report surveys techniques for performing garbage collection for languages such as C and C++, and presents an implementation of a concurrent copying collector fo...
متن کاملConcurrent Garbage Collection for Concurrent Rewriting
We describe an algorithm that achieves garbage collection when performing concurrent rewriting. We show how this algorithm follows the implementation model of concurrent graph rewriting. This model has been studied and directly implemented on MIMD machines where nodes of the graph are distributed over a set of processors. A distinguishing feature of our algorithm is that it collects garbage con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Methods in System Design
سال: 2009
ISSN: 0925-9856,1572-8102
DOI: 10.1007/s10703-009-0083-z